DNA Code Design Based on the Bloch Quantum Chaos Algorithm

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Quantum Ant Colony Algorithm Based on Bloch Coordinates

The Ant Colony Algorithm is an effective method for solving combinatorial optimization problems. However, in practical applications, there also exist issues such as slow convergence speed and easy to fall into local extremum. This paper proposes an improved Quantum Ant Colony Algorithm based on Bloch coordinates by combining Quantum Evolutionary Algorithm with Ant Colony Algorithm. In this algo...

متن کامل

A chaos-based video watermarking algorithm

The intriguing characteristics of chaotic maps have prompted researchers to use these sequences in watermarking systems to good effect. In this paper we aim to use a tent map to encrypt the binary logo to achieve a like-noise signal. This approach makes extraction of the watermark signal by potential attacker very hard. Embedding locations are selected based on certain principles. Experimental ...

متن کامل

Quantum-inspired artificial fish swarm algorithm based on the Bloch sphere searching

To enhance the performance of the intelligent optimization algorithm, a new model of performing search on the Bloch sphere is proposed. Then, by integrating the model into the artificial fish swarm optimization, we present a quantum-inspired artificial fish swarm optimization algorithm. In proposed method, the fishes are encoded with the qubits described on the Bloch sphere. The vector product ...

متن کامل

Unital Quantum Operations on the Bloch Ball and Bloch Region

For one qubit systems, we present a short, elementary argument characterizing unital quantum operators in terms of their action on Bloch vectors. We then show how our approach generalizes to multi-qubit systems, obtaining inequalities that govern when a “diagonal” superoperator on the Bloch region is a quantum operator. These inequalities are the n-qubit analogue of the Algoet-Fujiwara conditio...

متن کامل

DNA Code Word Design

The design of codes that satisfy combinatorial constraints is motivated by the problem of sending information reliably over a noisy channel and has been studied for a long time. There are lots of studies on binary code design where the alphabet consists of 2 letters {0, 1}. Recently, designing codes over 4 letters alphabet, which is motivated by the task of storing and retrieving information in...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Access

سال: 2017

ISSN: 2169-3536

DOI: 10.1109/access.2017.2760882